Open Bisimulations on Chi Processes
نویسنده
چکیده
The paper carries out a systematic investigation into the axiomatization problem of the asymmetric chi calculus. As a crucial step in attacking the problem, an open style bisimilarity is defined for each of the eighteen L-bisimilarities and the two are proved to be equal. On top of the open bisimilarities, explicit definitions of the eighteen L-congruences are given, which suggest immediately possible axioms for the congruence relations. In addition to the axioms for strong bisimilarity, the paper proposes altogether twenty one additional axioms, three of which being the well-known tau laws and the other eighteen being new. These axioms help to lift a complete system for the strong bisimilarity to complete systems for the eighteen L-congruences.
منابع مشابه
A Partition Refinement Algorithm for the -Calculus
The partition reenement algorithm 10, 6] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCS-like nite state processes. In this paper, we present a partition reenement algorithm for the-calculus 7], a development of CCS where channel names can be communicated. It can be used to check bisimilarity and to compute minimal realisat...
متن کاملOpen Maps Bisimulations for Higher Dimensional Automata Models
The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of two models – higher dimensional automata (HDA) and timed higher dimensional automata (THDA) – in order to transfer general concepts of equivalences to the models. First, we define categories of the models under consideration, whose morphisms are to be thought of as simulat...
متن کاملSound Bisimulations for Higher-Order Distributed Process Calculus
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...
متن کاملBisimulations for Nondeterministic Labeled Markov Processes
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define nondeterministic labeled Markov processes (NLMP) and provide three definition of bisimulations: a bisimulation following a traditional characterization, a state based ...
متن کاملTimed Network Semantics for Communicating Processes
Timed network semantics for CCS, which incorporate to the behaviour of timed processes also a capacity of communication network, are introduced. All these semantics are suitable for bottom-up speciications. A decreasing hierarchy of rigorous network bisimulations is presented. These bisimulations are non-interleaving reenements of the usual strong bisim-ulation. A complete and sound proof syste...
متن کامل